Cold Start Thread Recommendation as Extreme Multi-label Classification

نویسندگان

  • Kishaloy Halder
  • Lahari Poddar
  • Min-Yen Kan
چکیده

In public online discussion forums, the large user base and frequent posts can create challenges for recommending threads to users. Importantly, traditional recommender systems, based on collaborative filtering, are not capable of handling never-seen-before items (threads). We can view this task as a form of Extreme Multilabel Classification (XMLC), where for a newly-posted thread, we predict the set of users (labels) who will want to respond to it. Selecting a subset of users from the set of all users in the community poses significant challenges due to scalability, and sparsity. We propose a neural network architecture to solve this new thread recommendation task. Our architecture uses stacked bi-directional Gated Recurrent Units (GRU) for text encoding along with cluster sensitive attention for exploiting correlations among the large label space. Experimental evaluation with four datasets from different domains show that our model outperforms both the state-of-the-art recommendation systems as well as other XMLC approaches for this task in terms of MRR, Recall, and NDCG.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Supplementary : Extreme Multi-label Learning with Label Features for Warm-start Tagging, Ranking & Recommendation

Section 1 presents the pseudocodes for SwiftXML training and prediction algorithms. Section 2 reports complete set of experimental results comparing SwiftXML to various baselines in terms of both propensity-scored precisions (PSP1,PSP3,PSP5) as well as standard precisions (P1,P3,P5). Section 3 shows the derivations for individual steps of the alternating minimization algorithm used for node par...

متن کامل

“Like Attracts Like!”– A Social Recommendation Framework Through Label Propagation

Recently label propagation recommendation receives much attention from both industrial and academic fields due to its low requirement of labeled training data and effective prediction. Previous methods propagate preferences on a user or item similarity graph for making recommendation. However, they still suffer some major problems, including data sparsity, lack of trustworthiness, cold-start pr...

متن کامل

Learning Extreme Multi-label Tree-classifier via Nearest Neighbor Graph Partitioning

Web scale classification problems, such as Web page tagging and E-commerce product recommendation, are typically regarded as multi-label classification with an extremely large number of labels. In this paper, we propose GPT, which is a novel tree-based approach for extreme multi-label learning. GPT recursively splits a feature space with a hyperplane at each internal node, considering approxima...

متن کامل

Exploiting Associations between Class Labels in Multi-label Classification

Multi-label classification has many applications in the text categorization, biology and medical diagnosis, in which multiple class labels can be assigned to each training instance simultaneously. As it is often the case that there are relationships between the labels, extracting the existing relationships between the labels and taking advantage of them during the training or prediction phases ...

متن کامل

Revisiting the Vector Space Model: Sparse Weighted Nearest-Neighbor Method for Extreme Multi-Label Classification

Machine learning has played an important role in information retrieval (IR) in recent times. In search engines, for example, query keywords are accepted and documents are returned in order of relevance to the given query; this can be cast as a multi-label ranking problem in machine learning. Generally, the number of candidate documents is extremely large (from several thousand to several millio...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2018